Minimal sets of vectors which generate $R_n$ with excess $k$
نویسندگان
چکیده
منابع مشابه
Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملMinimal k-Free Representations of Frequent Sets
Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise rep...
متن کاملWhich point sets admit a k-angulation?
For k ≥ 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V (G) onto P and has the same facial cycles and outer face as G. We investigate the conditions under which a point set P admits a k-angulation and find that, for sets containing at least 2k2 points, th...
متن کاملLarge minimal sets which force long arithmetic progressions
A classic theorem of van der Waerden asserts that for any positive integer k, there is an integer W(k) with the property that if IV> W(k) and the set { 1,2,..., W} is partitioned into r classes C,, C?,..., C,, then some C, will always contain a k-term arithmetic progression. Let us abbreviate this assertion by saying that { 1, 2,..., W} arrows AP(k) (written { 1, 2,..., IV} + AP(k)). Further, w...
متن کاملOrthogonalization of Vectors with Minimal Adjustment
A new transformation is proposed that gives orthogonal components with a one-to-one correspondence between the original vectors and the components. The aim is that each component should be close to the vector with which it is paired, orthogonality imposing a constraint. If the vectors have been normalized, then the transformation minimizes the sum of the squared correlations between each vector...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1979
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1979.101596